Supersaturation for hereditary properties

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Supersaturation for hereditary properties

Let F be a collection of r-uniform hypergraphs, and let 0 < p < 1. It is known that there exists c = c(p,F) such that the probability of a random r-graph in G(n, p) not containing an induced subgraph from F is 2(−c+o(1))( n r). Let each r-graph in F have at least t vertices. We show that in fact for every > 0, there exists δ = δ( , p,F) > 0 such that the probability of a random r-graph in G(n, ...

متن کامل

Ideal Amenability of Banach Algebras and Some Hereditary Properties

Let A be a Banach algebra. A is called ideally amenable if for every closed ideal I of A, the first cohomology group of A with coefficients in I* is trivial. We investigate the closed ideals I for which H1 (A,I* )={0}, whenever A is weakly amenable or a biflat Banach algebra. Also we give some hereditary properties of ideal amenability.

متن کامل

Hereditary properties of words

Let P be a hereditary property of words, i.e., an infinite class of finite words such that every subword (block) of a word belonging to P is also in P . Extending the classical Morse-Hedlund theorem, we show that either P contains at least n+1 words of length n for every n or, for some N , it contains at most N words of length n for every n. More importantly, we prove the following quantitative...

متن کامل

Hereditary Properties of Tournaments

A collection of unlabelled tournaments P is called a hereditary property if it is closed under isomorphism and under taking induced sub-tournaments. The speed of P is the function n 7→ |Pn|, where Pn = {T ∈ P : |V (T )| = n}. In this paper, we prove that there is a jump in the possible speeds of a hereditary property of tournaments, from polynomial to exponential speed. Moreover, we determine t...

متن کامل

Hereditary properties of hypergraphs

A hereditary property P is a class of k-graphs closed under isomorphism and taking induced sub-hypergraphs. Let P (k) n denote those k-graphs of P (k) on vertex set {1, . . . , n}. We prove an asymptotic formula for log2 |P (k) n | in terms of a Turán-type function concerning forbidden induced sub-hypergraphs. This result complements several existing theorems for hereditary and monotone graph a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: European Journal of Combinatorics

سال: 2012

ISSN: 0195-6698

DOI: 10.1016/j.ejc.2011.10.008